Distributed Momentum-Based Frank-Wolfe Algorithm for Stochastic Optimization

نویسندگان

چکیده

This paper considers distributed stochastic optimization, in which a number of agents cooperate to optimize global objective function through local computations and information exchanges with neighbors over network. Stochastic optimization problems are usually tackled by variants projected gradient descent. However, projecting point onto feasible set is often expensive. The Frank-Wolfe (FW) method has well-documented merits handling convex constraints, but existing FW algorithms basically developed for centralized settings. In this context, the present work puts forth solver, judiciously combining Nesterov's momentum tracking techniques nonconvex networks. It shown that convergence rate proposed algorithm $\mathcal{O}(k^{-\frac{1}{2}})$ xmlns:xlink="http://www.w3.org/1999/xlink">$\mathcal{O}(1/\log_{2}(k))$ optimization. efficacy demonstrated numerical simulations against competing alternatives.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Distributed Frank-Wolfe Algorithm for Communication-Efficient Sparse Learning

Learning sparse combinations is a frequent theme in machine learning. In this paper, we study its associated optimization problem in the distributed setting where the elements to be combined are not centrally located but spread over a network. We address the key challenges of balancing communication costs and optimization errors. To this end, we propose a distributed Frank-Wolfe (dFW) algorithm...

متن کامل

Linear Convergence of Stochastic Frank Wolfe Variants

In this paper, we show that the Away-step Stochastic Frank-Wolfe (ASFW) and Pairwise Stochastic Frank-Wolfe (PSFW) algorithms converge linearly in expectation. We also show that if an algorithm convergences linearly in expectation then it converges linearly almost surely. In order to prove these results, we develop a novel proof technique based on concepts of empirical processes and concentrati...

متن کامل

A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization

We present an exact algorithm for mean-risk optimization subject to a budget constraint, where decision variables may be continuous or integer. The risk is measured by the covariance matrix and weighted by an arbitrary monotone function, which allows to model risk-aversion in a very individual way. Our approach is a branch-and-bound algorithm, where at each node, the continuous relaxation is so...

متن کامل

A Frank-Wolfe Based Branch-and-Bound Algorithm for Mixed-Integer Portfolio Optimization

We address the solution of a large class of convex mixed-integer nonlinear programming problems. The model we are considering generalizes problems that are commonly considered in portfolio optimization, such as the risk-averse capital budgeting problem. In our generalization we allow to take into account integer and continuous variables as well as an arbitrary weighting of the risk. In order to...

متن کامل

Bandit Optimization with Upper-Confidence Frank-Wolfe

We consider the problem of bandit optimization, inspired by stochastic optimization and online learning problems with bandit feedback. In this problem, the objective is to minimize a global loss function of all the actions, not necessarily a cumulative loss. This framework allows us to study a very general class of problems, with applications in statistics, machine learning, and other fields. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE/CAA Journal of Automatica Sinica

سال: 2023

ISSN: ['2329-9274', '2329-9266']

DOI: https://doi.org/10.1109/jas.2022.105923